A way to construct independence equivalent graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to construct equivalent differential systems

For two differential systems, an algorithm which permits us to say whether reflecting functions of these systems coincide or not is given. It allows studying qualitative properties of these two systems simultaneously. © 2009 Elsevier Ltd. All rights reserved.

متن کامل

New Way to Construct Cryptographic Hash Function

In this paper, a new way to construct cryptographic hash function is given. The cryptographic hash function is generalized to uncertain function which has various specific function forms. When computing hash value, the specific form of the function is determined by the message, but the codebreaker cannot know the message, and hence cannot know the specific form of random function. This provides...

متن کامل

A More Natural Way to Construct Identity-Based Identification Schemes

Constructing identification schemes is one of the fundamental problems in cryptography, and is very useful in practice. An identitybased identification (IBI) scheme allows a prover to identify itself to a public verifier who knows only the claimed identity of the prover and some common information. In this paper, we propose a simple and efficient framework for constructing IBI schemes. Unlike s...

متن کامل

Independence in Function Graphs

Given two graphs G and H and a function f ⊂ V (G) × V (H), Hedetniemi [9] defined the function graph GfH by V (GfH) = V (G)∪ V (H) and E(GfH) = E(G) ∪ E(H) ∪ {uv|v = f(u)}. Whenever G ∼= H, the function graph was called a functigraph by Chen, Ferrero, Gera and Yi [7]. A function graph is a generalization of the α-permutation graph introduced by Chartrand and Harary [5]. The independence number ...

متن کامل

Distance independence in graphs

For a set D of positive integers, we define a vertex set S ⊆ V (G) to be D-independent if u, v ∈ S implies the distance d(u, v) 6∈ D. The D-independence number βD(G) is the maximum cardinality of a D-independent set. In particular, the independence number β(G) = β{1}(G). Along with general results we consider, in particular, the odd-independence number βODD(G) where ODD = {1, 3, 5, . . .}.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2012

ISSN: 0893-9659

DOI: 10.1016/j.aml.2011.11.033